Improved Genetic Algorithm with Gene Recombination for Bus Crew-Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Multiobjective Genetic Algorithm to Solve the Train Crew Scheduling Problem
-This paper presents a multiobjective genetic algorithm (MOGA)to solve the train crew pairing problem in railway companies. The proposed MOGA has several features, such as 1) A permutation-based model is proposed rather than the 0-1 set partition model. 2) Instead of pre-assigning a fixed group number of crewmembers, the proposed method can determine it by performing the evolutionary process. 3...
متن کاملA Genetic Algorithm Developed for a Supply Chain Scheduling Problem
This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...
متن کاملAn Improved Genetic Algorithm for Resource Constrained Project Scheduling Problem
Project scheduling with limited resources is a challenging management problem that is of immense importance to both practitioners and researchers. This problem is known to be NP-hard even under the simplifying assumptions of single renewable resource constraint, its constant availability over time and minimization of makespan as objective. This paper presents an improved Genetic Algorithm (GA) ...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملImproved genetic algorithm for the permutation flowshop scheduling problem
Genetic algorithms (GAs) are search heuristics used to solve global optimization problems in complex search spaces. We wish to show that the e6ciency of GAs in solving a &owshop problem can be improved signi7cantly by tailoring the various GA operators to suit the structure of the problem. The &owshop problem is one of scheduling jobs in an assembly line with the objective of minimizing the com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/719409